Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Network representation learning model based on node attribute bipartite graph
Le ZHOU, Tingting DAI, Chun LI, Jun XIE, Boce CHU, Feng LI, Junyi ZHANG, Qiao LIU
Journal of Computer Applications    2022, 42 (8): 2311-2318.   DOI: 10.11772/j.issn.1001-9081.2021060972
Abstract648)   HTML140)    PDF (843KB)(440)       Save

It is an important task to carry out reasoning and calculation on graph structure data. The main challenge of this task is how to represent graph-structured knowledge so that machines can easily understand and use graph structure data. After comparing the existing representation learning models, it is found that the models based on random walk methods are likely to ignore the special effect of attributes on the association between nodes. Therefore, a hybrid random walk method based on node adjacency and attribute association was proposed. Firstly the attribute weights were calculated through the common attribute distribution among adjacent nodes, and the sampling probability from the node to each attribute was obtained. Then, the network information was extracted from adjacent nodes and non-adjacent nodes with common attributes respectively. Finally, the network representation learning model based on node attribute bipartite graph was constructed, and the node vector representations were obtained through the above sampling sequence learning. Experimental results on Flickr, BlogCatalog and Cora public datasets show that the Micro-F1 average accuracy of node classification by the node vector representations obtained by the proposed model is 89.38%, which is 2.02 percentage points higher than that of GraphRNA (Graph Recurrent Networks with Attributed random walk) and 21.12 percentage points higher than that of classical work DeepWalk. At the same time, by comparing different random walk methods, it is found that increasing the sampling probabilities of attributes that promote node association can improve the information contained in the sampling sequence.

Table and Figures | Reference | Related Articles | Metrics
3D face reconstruction and recognition based on feature division
LU Le ZHOU Da-ke HU Yang-ming
Journal of Computer Applications    2012, 32 (11): 3189-3192.   DOI: 10.3724/SP.J.1087.2012.03189
Abstract1044)      PDF (702KB)(578)       Save
The traditional algorithm of 3D face reconstruction is inefficient and it is difficult to meet the requirements of practical application. To address this problem, a feature-slice-based 3D face reconstruction algorithm was proposed. Besides, the feature-slice-based weighed 3D face recognition was proposed on the basis of the reconstruction algorithm. First, a 2D template-based alignment algorithm was developed to process the correspondence between faces automatically, and a linear facial model was built up. Second, an improved Active Shape Model (ASM) algorithm was proposed to locate the feature points and slices in the 3D and 2D face images. Then, every facial feature slices shape was reconstructed by a PCA-based sparse morphable mode. Finally, the algorithm was applied to 3D face recognition. The experimental results show that the presented algorithm has higher efficiency and accuracy, and improves the 3D face recognition rate.
Reference | Related Articles | Metrics